Intersection Theorems for Finite Sets and Geometric Applications
نویسنده
چکیده
1. Introduction. Let X be an n-element set and F C 2 X a family of distinct subsets of X. Suppose that the members of F satisfy some conditions. What is the maximum (or minimum) value of |F|—this is the generic problem in extremal set theory. There have been far too many papers and results in this area to be overviewed in such a short paper. Therefore, we will only deal with some intersection theorems. The simplest is
منابع مشابه
Bose-Burton type theorems for finite Grassmannians
In this paper both blocking sets with respect to the s-subspaces and covers with t-subspaces in a finite Grassmannian are investigated, especially focusing on geometric descriptions of blocking sets and covers of minimum size. When such a description exists, it is called a Bose–Burton type theorem. The canonical example of a blocking set with respect to the s-subspaces is the intersection of s ...
متن کاملDelta sets for divisors supported in two points
In [8], the authors formulate new coset bounds for algebraic geometric codes. The bounds give improved lower bounds for the minumum distance of algebraic geometric codes as well as improved thresholds for algebraic geometric linear secret sharing schemes. The coset bounds depend on the choice of a sequence of divisors and on its intersection with a given set of divisors called a delta set. In t...
متن کاملWeak and strong convergence theorems for a finite family of generalized asymptotically quasinonexpansive nonself-mappings
In this paper, we introduce and study a new iterative scheme toapproximate a common xed point for a nite family of generalized asymptoticallyquasi-nonexpansive nonself-mappings in Banach spaces. Several strong and weakconvergence theorems of the proposed iteration are established. The main resultsobtained in this paper generalize and rene some known results in the currentliterature.
متن کاملConvex Polygon Intersection Graphs
Geometric intersection graphs are graphs determined by the intersections of certain geometric objects. We study the complexity of visualizing an arrangement of objects that induces a given intersection graph. We give a general framework for describing classes of geometric intersection graphs, using arbitrary finite base sets of rationally given convex polygons and rationally-constrained affine ...
متن کاملHesitant q-rung orthopair fuzzy aggregation operators with their applications in multi-criteria decision making
The aim of this manuscript is to present a new concept of hesitant q-rung orthopair fuzzy sets (Hq-ROFSs) by combining the concept of the q-ROFSs as well as Hesitant fuzzy sets. The proposed concept is the generalization of the fuzzy sets, intuitionistic fuzzy sets, hesitant fuzzy sets, and Pythagorean fuzzy sets as well as intuitionistic hesitant fuzzy sets (IHFSs) and hesitant Pythagorean fuz...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010